The power of primitive positive definitions with polynomially many variables
نویسندگان
چکیده
منابع مشابه
HIBE with Polynomially Many Levels
We present the first hierarchical identity based encryption (HIBE) system that has full security for more than a constant number of levels. In all prior HIBE systems in the literature, the security reductions suffered from exponential degradation in the depth of the hierarchy, so these systems were only proven fully secure for identity hierarchies of constant depth. (For deep hierarchies, previ...
متن کاملconstruction of vector fields with positive lyapunov exponents
in this thesis our aim is to construct vector field in r3 for which the corresponding one-dimensional maps have certain discontinuities. two kinds of vector fields are considered, the first the lorenz vector field, and the second originally introced here. the latter have chaotic behavior and motivate a class of one-parameter families of maps which have positive lyapunov exponents for an open in...
15 صفحه اولOn Online Labeling with Polynomially Many Labels
In the online labeling problem with parameters n,m, r, we are presented with a sequence of n keys from a totally ordered universe U of size r and must assign each arriving key a label from the label set {1, 2, . . . ,m} so that the order of labels (strictly) respects the ordering on U . As new keys arrive it may be necessary to change the labels of some items; such changes may be done at any ti...
متن کاملQMA variants with polynomially many provers
We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each of logarithmic-size, is exactly MQA (also known as QCMA), the class of problems which can be efficiently verified via a classical proof and a quantum verifier. We then study the class BellQMA(poly), ch...
متن کاملThe Structure of Locally Finite Varieties with Polynomially Many Models
In this paper, variety means a class of similar algebras—i.e., models of one firstorder language without relation symbols—which is defined by the satisfaction of some fixed sets of equations. A variety is locally finite if all of its finitely generated members are finite. Following J. Berman and P. Idziak [2], the G-spectrum, or generative complexity, of a locally finite variety C, is the funct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2016
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exw005